<title>最大数</title><link href="http://hzoi.com/tomorrow.css" rel="stylesheet"><div class="ui existing segment"><pre><code><span class="pl-cp">#include</span><span class="pl-cpf">&lt;cstdio&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#include</span><span class="pl-cpf">&lt;iostream&gt;</span><span class="pl-cp"></span>
<span class="pl-cp">#define ull unsigned long long</span>
<span class="pl-k">using</span> <span class="pl-k">namespace</span> <span class="pl-n">std</span><span class="pl-p">;</span>
<span class="pl-n">ull</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-mi">800005</span><span class="pl-p">],</span> <span class="pl-n">arg</span><span class="pl-p">[</span><span class="pl-mi">200005</span><span class="pl-p">];</span>
<span class="pl-kt">char</span> <span class="pl-n">opt</span><span class="pl-p">[</span><span class="pl-mi">200005</span><span class="pl-p">];</span>
<span class="pl-n">ull</span> <span class="pl-nf">query</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">p</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">s</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">t</span><span class="pl-p">)</span> <span class="pl-p">{</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-o">&lt;=</span><span class="pl-n">l</span> <span class="pl-o">&amp;&amp;</span> <span class="pl-n">r</span><span class="pl-o">&lt;=</span><span class="pl-n">t</span><span class="pl-p">)</span> <span class="pl-k">return</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">p</span><span class="pl-p">];</span>
    <span class="pl-kt">int</span> <span class="pl-n">m</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">+</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-o">&gt;&gt;</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-n">ull</span> <span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">s</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">ans</span><span class="pl-p">,</span> <span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-n">p</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">l</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">s</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-p">));</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">t</span><span class="pl-o">&gt;</span><span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-n">ans</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">ans</span><span class="pl-p">,</span> <span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-n">p</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">r</span><span class="pl-p">,</span> <span class="pl-n">s</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-p">));</span>
    <span class="pl-k">return</span> <span class="pl-n">ans</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
<span class="pl-kt">void</span> <span class="pl-nf">update</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">p</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">l</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">r</span><span class="pl-p">,</span> <span class="pl-kt">int</span> <span class="pl-n">t</span><span class="pl-p">,</span> <span class="pl-n">ull</span> <span class="pl-n">v</span><span class="pl-p">){</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">==</span><span class="pl-n">r</span><span class="pl-p">)</span> <span class="pl-k">return</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">p</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">v</span><span class="pl-p">,</span> <span class="pl-kt">void</span><span class="pl-p">();</span>
    <span class="pl-kt">int</span> <span class="pl-n">m</span><span class="pl-o">=</span><span class="pl-p">(</span><span class="pl-n">l</span><span class="pl-o">+</span><span class="pl-n">r</span><span class="pl-p">)</span><span class="pl-o">&gt;&gt;</span><span class="pl-mi">1</span><span class="pl-p">;</span>
    <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">t</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">)</span> <span class="pl-n">update</span><span class="pl-p">(</span><span class="pl-n">p</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">l</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">);</span>
    <span class="pl-k">else</span> <span class="pl-n">update</span><span class="pl-p">(</span><span class="pl-n">p</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">m</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">r</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-p">,</span> <span class="pl-n">v</span><span class="pl-p">);</span>
    <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">p</span><span class="pl-p">]</span><span class="pl-o">=</span><span class="pl-n">max</span><span class="pl-p">(</span><span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">p</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-p">],</span> <span class="pl-n">tree</span><span class="pl-p">[</span><span class="pl-n">p</span><span class="pl-o">&lt;&lt;</span><span class="pl-mi">1</span><span class="pl-o">|</span><span class="pl-mi">1</span><span class="pl-p">]);</span>
<span class="pl-p">}</span>
<span class="pl-kt">int</span> <span class="pl-nf">main</span><span class="pl-p">()</span> <span class="pl-p">{</span>
    <span class="pl-kt">int</span> <span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-n">mi</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-n">n</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">;</span>
    <span class="pl-n">ull</span> <span class="pl-n">t</span><span class="pl-o">=</span><span class="pl-mi">0</span><span class="pl-p">,</span> <span class="pl-n">d</span><span class="pl-p">;</span>
    <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot;%d%llu&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">m</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">d</span><span class="pl-p">);</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
        <span class="pl-n">scanf</span><span class="pl-p">(</span><span class="pl-s">&quot; %c%llu&quot;</span><span class="pl-p">,</span> <span class="pl-o">&amp;</span><span class="pl-n">opt</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">],</span> <span class="pl-o">&amp;</span><span class="pl-n">arg</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]);</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">opt</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">==</span><span class="pl-sc">&#39;A&#39;</span><span class="pl-p">)</span><span class="pl-n">n</span><span class="pl-o">++</span><span class="pl-p">;</span>
    <span class="pl-p">}</span>
    <span class="pl-k">for</span><span class="pl-p">(</span><span class="pl-kt">int</span> <span class="pl-n">i</span><span class="pl-o">=</span><span class="pl-mi">1</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">&lt;=</span><span class="pl-n">m</span><span class="pl-p">;</span><span class="pl-n">i</span><span class="pl-o">++</span><span class="pl-p">){</span>
        <span class="pl-k">if</span><span class="pl-p">(</span><span class="pl-n">opt</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">==</span><span class="pl-sc">&#39;Q&#39;</span><span class="pl-p">)</span> <span class="pl-p">{</span>
            <span class="pl-n">printf</span><span class="pl-p">(</span><span class="pl-s">&quot;%llu</span><span class="pl-se">\n</span><span class="pl-s">&quot;</span><span class="pl-p">,</span> <span class="pl-n">t</span><span class="pl-o">=</span><span class="pl-n">query</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">mi</span><span class="pl-o">-</span><span class="pl-n">arg</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">mi</span><span class="pl-p">));</span>
        <span class="pl-p">}</span> <span class="pl-k">else</span> <span class="pl-p">{</span>
            <span class="pl-n">mi</span><span class="pl-o">++</span><span class="pl-p">;</span>
            <span class="pl-n">update</span><span class="pl-p">(</span><span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-mi">1</span><span class="pl-p">,</span> <span class="pl-n">n</span><span class="pl-p">,</span> <span class="pl-n">mi</span><span class="pl-p">,</span> <span class="pl-p">(</span><span class="pl-n">arg</span><span class="pl-p">[</span><span class="pl-n">i</span><span class="pl-p">]</span><span class="pl-o">+</span><span class="pl-n">t</span><span class="pl-p">)</span><span class="pl-o">%</span><span class="pl-n">d</span><span class="pl-p">);</span>
        <span class="pl-p">}</span>
    <span class="pl-p">}</span>
    <span class="pl-k">return</span> <span class="pl-mi">0</span><span class="pl-p">;</span>
<span class="pl-p">}</span>
</cpde></pre></div>